/*
 * BalancedBinaryTree.c
 *
 *  Created on: 07/07/2012
 *      Author: marcio
 */

#include "BalancedBinaryTree.h"

BalancedBinaryTreeNode* balancedbinarytreenode_newNode(void* elem){
	return NULL;
}

int balancedbinarytreenode_addToRight(BalancedBinaryTreeNode* root, BalancedBinaryTreeNode* newnode){
	return 0;
}

int balancedbinarytreenode_addToLeft(BalancedBinaryTreeNode* root, BalancedBinaryTreeNode* newnode){
	return 0;
}

BalancedBinaryTree* balancedbinarytree_newBalancedBinaryTree(, int (*choice)(void*, void*)){
	return NULL;
}

int tree_getSize(BalancedBinaryTree* b){
	return 0;
}

BalancedBinaryTreeNode* balancedbinarytree_getRoot(BalancedBinaryTree* b){
	return NULL;
}

int balancedbinarytree_addNode(BalancedBinaryTree* b, BalancedBinaryTreeNode* newnode){
	return NULL;
}

BalancedBinaryTreeNode** balancedbinarytree_BFS(BalancedBinaryTree* b){
	return NULL;
}

BalancedBinaryTreeNode** balancedbinarytree_DFS(BalancedBinaryTree* b){
	return NULL;
}

BalancedBinaryTreeNode** balancedbinarytree_BFSOnlyLeafs(BalancedBinaryTree* b){
	return NULL;
}

BalancedBinaryTreeNode** balancedbinarytree_DFSOnlyLeafs(BalancedBinaryTree* b){
	return NULL;
}

int balancedbinarytree_BFSModify(BalancedBinaryTree* b,int (f)(void*)){
	return 0;
}

int balancedbinarytree_DFSModify(BalancedBinaryTree* b,int (f)(void*)){
	return 0;
}

int balancedbinarytree_delete(BalancedBinaryTree* b){
	return 0;
}
